Minimum cycle basis of direct product of K2×Kn
نویسندگان
چکیده
منابع مشابه
Minimum cycle bases of product graphs
A construction for a minimal cycle basis for the Cartesian and the strong product of two graphs from the minimal length cycle bases of the factors is presented. Furthermore, we derive asymptotic expressions for the average length of the cycles in the minimal cycle bases of the powers (iterated products) of graphs. In the limit only triangles and squares play a role.
متن کاملAn Õ(mn) Algorithm for Minimum Cycle Basis of Graphs∗
We consider the problem of computing a minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices. In this problem, a {0, 1} incidence vector is associated with each cycle and the vector space over F2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis whe...
متن کاملCharacterization of Minimum Cycle Basis in Weighted Partial 2-trees
For a weighted outerplanar graph, the set of lex short cycles is known to be a minimum cycle basis [Inf. Process. Lett. 110 (2010) 970-974 ]. In this work, we show that the set of lex short cycles is a minimum cycle basis in weighted partial 2-trees (graphs of treewidth two) which is a superclass of outerplanar graphs.
متن کاملA Faster Algorithm for Minimum Cycle Basis of Graphs
In this paper we consider the problem of computing a minimum cycle basis in a graph G with m edges and n vertices. The edges of G have non-negative weights on them. The previous best result for this problem was an O(mn) algorithm, where ω is the best exponent of matrix multiplication. It is presently known that ω < 2.376. We obtain an O(mn +mn logn) algorithm for this problem. Our algorithm als...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2014
ISSN: 0024-3795
DOI: 10.1016/j.laa.2014.06.042